Quantifier Elimination and Information Flow Control for Software Security

نویسنده

  • Gregor Snelting
چکیده

Program Dependency Graphs and Constraint Solving can be combined to achieve a powerful tool for information flow control, allowing to check source code for security problems such as external manipulation of critical computations. The method generates path conditions for critical information flows, being conditions over the program variables necessary for flow. As all variables are existentially quantified, quantifier elimination and in particular the REDLOG system developed at Volker Weispfenning’s group, are used to solve path conditions for the input variables, thus generating witnesses for security leaks.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantifier Elimination in Automatic Loop Parallelization

We present an application of quantifier elimination techniques in the automatic parallelization of nested loop programs. The technical goal is to simplify affine inequalities whose coefficients may be unevaluated symbolic constants. The values of these so-called structure parameters are determined at run time and reflect the problem size. Our purpose here is to make the research community of qu...

متن کامل

CAMAC: a context-aware mandatory access control model

Mandatory access control models have traditionally been employed as a robust security mechanism in multilevel security environments such as military domains. In traditional mandatory models, the security classes associated with entities are context-insensitive. However, context-sensitivity of security classes and flexibility of access control mechanisms may be required especially in pervasive c...

متن کامل

Quantifier Elimination in Fields

Here we give a detailed description of the quantifier elimination algorithm for algebraically closed fields (ACF); We also describe its implementation in the system AFC-EQ that was developed in GIS Group for Inteligent Systems on the Faculty of Mathematics, University of Belgrade.

متن کامل

Nonlinear Control System Design by Quantifier Elimination

Many problems in control theory can be formulated as formulae in the first-order theory of real closed fields. In this paper we investigate some of the expressive power of this theory. We consider dynamical systems described by polynomial differential equations subjected to constraints on control and system variables and show how to formulate questions in the above framework which can be answer...

متن کامل

Applications of Quantifier Elimination Theory to Control System Design

In this paper we show how a number of interesting linear control system analysis and design problems can be reduced to Quantiier Elimination (QE) problems. We assume a xed structure for the compensator, with design parameters q i. The problems considered are problems that currently have no general solution. However, the problems must be of modest complexity if existing QE software packages are ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005